Research of Improved Shuffled Frog Leaping Algorithm in Cloud Computing Resources
نویسندگان
چکیده
Resource scheduling under the condition of cloud computing has always been the focus of current research. This paper analyzes the current situation of cloud computing and introduces shuffled frog leaping algorithm in resource allocation. Aiming at that shuffled frog algorithm is easy to fall into local optimum with fast convergence speed, artificial vector machine is introduced into the subgroups of shuffled frog leaping algorithm, then, self-adaptive crossover probability is introduced into the algorithm’s interior searching. The improved shuffled frog leaping algorithm effectively avoids the algorithm from falling into local optimum and meanwhile shortens the time of global searching and optimum. Classic function proves the performance of algorithm in this paper is improved greatly, and CloudSim platform demonstrates that algorithm in this paper can improve the system’s efficiency into processing tasks and make resource allocation in cloud computing reasonable and effective.
منابع مشابه
Combined Heat and Power Economic Dispatch using Improved Shuffled Frog Leaping Algorithm
Recently, Combined Heat and Power (CHP) systems have been utilized increasingly in power systems. With the addition penetration of CHP-based co-generation of electricity and heat, the determination of economic dispatch of power and heat becomes a more complex and challenging issue. The optimal operation of CHP-based systems is inherently a nonlinear and non-convex optimization problem with a lo...
متن کاملUsing the Modified Shuffled Frog Leaping Algorithm for Optimal Sizing and location of Distributed Generation Resources for Reliability Improvement
Restructuring the recent developments in the power system and problems arising from construction as well as the maintenance of large power plants lead to increase in using the Distributed Generation (DG) resources. DG units due to its specifications, technology and location network connectivity can improve system and load point reliability indices. In this paper, the allocation and sizing of di...
متن کاملGenetic and Improved Shuffled Frog Leaping Algorithms for a 2-Stage Model of a Hub Covering Location Network
Hub covering location problem, Network design, Single machine scheduling, Genetic algorithm, Shuffled frog leaping algorithm Hub location problems (HLP) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc....
متن کاملShuffled Frog-Leaping Programming for Solving Regression Problems
There are various automatic programming models inspired by evolutionary computation techniques. Due to the importance of devising an automatic mechanism to explore the complicated search space of mathematical problems where numerical methods fails, evolutionary computations are widely studied and applied to solve real world problems. One of the famous algorithm in optimization problem is shuffl...
متن کاملVoltage Flicker Parameters Estimation Using Shuffled Frog Leaping Algorithm and Imperialistic Competitive Algorithm
Measurement of magnitude and frequency of the voltage flicker is very important for monitoring andcontrolling voltage flicker efficiently to improve the network power quality. This paper presents twonew methods for measurement of flicker signal parameters using Shuffled Frog Leaping Algorithm(SFLA) and Imperialist Competitive Algorithm (ICA). This paper estimates fundamental voltage andflicker ...
متن کامل